Correlated Equilibrium in Games with Incomplete Information

We define a notion of correlated equilibrium for games with incomplete information in a general setting with finite players, finite actions, and finite states, which we call Bayes correlated equilibrium. The set of Bayes correlated equilibria of a fixed incomplete information game equals the set of probability distributions over actions, states and types that might arise in any Bayes Nash equilibrium where players observed additional information. We show that more information always shrinks the set of Bayes correlated equilibria.Correlated equilibrium, Incomplete information, Robust predictions, Information structure

Entry and Vertical Differentiation

This paper analyzes the entry of new products into vertically differentiated markets where an entrant and an incumbent compete in quantities. The value of the new product is initially uncertain and new information is generated through purchases in the market. We derive the (unique) Markov perfect equilibrium of the infinite horizon game under the strong long run average payoff criterion. The qualitative features of the optimal entry strategy are shown to depend exclusively on the relative ranking of established and new products based on current beliefs. Superior products are launched relatively slowly and at high initial prices whereas substitutes for existing products are launched aggressively at low initial prices. The robustness of these results with respect to different model specifications is discussed. Classification-JEL: C72, C73, D43, D83 Keywords: Entry, Duopoly, Quantity Competition, Vertical Differentiation, Bayesian Learning,Markov Perfect Equilibrium, Experimentation, Experience Goods

Information Structures in Optimal Auctions

A seller wishes to sell an object to one of multiple bidders. The valuations of the bidders are privately known. We consider the joint design problem in which the seller can decide the accuracy by which bidders learn their valuation and to whom to sell at what price. We establish that optimal information structures in an optimal auction exhibit a number of properties: (i) information structures can be represented by monotone partitions, (ii) the cardinality of each partition is finite, (iii) the partitions are asymmetric across agents. These properties imply that the optimal selling strategy of a seller can be implemented by a sequence of exclusive take-it or leave-it offers.Optimal Auction, Private Values, Information Structures, Partitions

Efficient Search by Committee

This note constructs an efficient mechanism for finding the best candidate for a committee from a sequence of potential candidates. Committee members have independent private values information about the quality of the candidate. The mechanism selects the best candidate according to the standard utilitarian welfare criterion. Furthermore, the mechanism can be modified to have a balanced budget.Search, Committtees, Voting, Mechanism design, Dynamic pivot mechanism

Dynamic Auctions: A Survey

We survey the recent literature on designing auctions and mechanisms for dynamic settings. Two settings are considered: those with a dynamic population of agents or buyers whose private information remains fixed throughout time; and those with a fixed population of agents or buyers whose private information changes across time. Within each of these settings, we discuss both efficient (welfare-maximizing) and optimal (revenue-maximizing) mechanisms.Dynamic auctions and mechanisms, Random arrivals and departures, Changing private information, Incentive compatibility